Cover-Incomparability Graphs of Posets
نویسندگان
چکیده
∗Work supported by the Ministry of Science of Slovenia and by the Ministry of Science and Technology of India under the bilateral India-Slovenia grants BI-IN/06-07-002 and DST/INT/SLOV-P03/05, respectively.
منابع مشابه
Characterizing subclasses of cover-incomparability graphs by forbidden subposets
In this paper we demonstrate that several theorems from [1] and [3] do not hold as they are stated. These are the theorems regarding forbidden subposet characterizations of certain classes of coverincomparability graphs. In this paper we correct a mistake in the main theorem of [1], reformulate the corresponding statements and present corrected proofs. We further characterize posets whose cover...
متن کاملUnit Incomparability Dimension and Clique Cover Width in Graphs
For a clique cover C in the undirected graph G, the clique cover graph of C is the graph obtained by contracting the vertices of each clique in C into a single vertex. The clique cover width of G, denoted by CCW (G), is the minimum value of the bandwidth of all clique cover graphs in G. Any G with CCW (G) = 1 is known to be an incomparability graph, and hence is called, a unit incomparability g...
متن کاملCharacterizing posets for which their natural transit functions coincide
The standard poset transit function of a poset P is a function TP that assigns to a pair of comparable elements the interval between them, while TP (x, y) = {x, y} for a pair x, y of incomparable elements. Posets in which the standard poset transit function coincides with the shortest-path transit function of its cover-incomparability graph are characterized in three ways, in particular with fo...
متن کاملMinors and Dimension
It has been known for 30 years that posets with bounded height and with cover graphs of bounded maximum degree have bounded dimension. Recently, Streib and Trotter proved that dimension is bounded for posets with bounded height and planar cover graphs, and Joret et al. proved that dimension is bounded for posets with bounded height and with cover graphs of bounded tree-width. In this paper, it ...
متن کاملThe dimension of posets with planar cover graphs excluding two long incomparable chains
It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such posets have two large disjoint chains with all points in one chain incomparable with all points in the other. Gutowski and Krawczyk conjectured that this feat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Order
دوره 25 شماره
صفحات -
تاریخ انتشار 2008